Improving Context-Sensitive Dependency Pairs
نویسندگان
چکیده
Context-sensitive dependency pairs (CS-DPs) are currently the most powerful method for automated termination analysis of contextsensitive rewriting. However, compared to DPs for ordinary rewriting, CS-DPs suffer from two main drawbacks: (a) CS-DPs can be collapsing. This complicates the handling of CS-DPs and makes them less powerful in practice. (b) There does not exist a “DP framework” for CS-DPs which would allow one to apply them in a flexible and modular way. This paper solves drawback (a) by introducing a new definition of CS-DPs. With our definition, CS-DPs are always non-collapsing and thus, they can be handled like ordinary DPs. This allows us to solve drawback (b) as well, i.e., we extend the existing DP framework for ordinary DPs to contextsensitive rewriting. We implemented our results in the tool AProVE and successfully evaluated them on a large collection of examples.
منابع مشابه
Improving the Context-sensitive Dependency Graph
The dependency pairs method is one of the most powerful technique for proving termination of rewriting and it is currently central in most automatic termination provers. Recently, it has been adapted to be used in proofs of termination of context-sensitive rewriting. The use of collapsing dependency pairs i.e., having a single variable in the right-hand side is a novel and essential feature to ...
متن کاملProving Termination in the Context-Sensitive Dependency Pairs Framework
Termination of context-sensitive rewriting (CSR) is an interesting problem with several applications in the fields of term rewriting and in the analysis of programming languages like CafeOBJ, Haskell, Maude, OBJ, etc. The dependency pairs approach, one of the most powerful techniques for proving termination of rewriting, has been adapted to be used for proving termination of CSR. The correspond...
متن کاملProving Termination in the Context-Sensitive Dependency Pair Framework
Termination of context-sensitive rewriting (CSR) is an interesting problem with several applications in the fields of term rewriting and in the analysis of programming languages like CafeOBJ, Maude, OBJ, etc. The dependency pair approach, one of the most powerful techniques for proving termination of rewriting, has been adapted to be used for proving termination of CSR. The corresponding notion...
متن کاملContext-Sensitive Dependency Pairs
Termination is one of the most interesting problems when dealing with context-sensitive rewrite systems. Although there is a good number of techniques for proving termination of context-sensitive rewriting (CSR), the dependency pair approach, one of the most powerful techniques for proving termination of rewriting, has not been investigated in connection with proofs of termination of CSR. In th...
متن کاملContext-Sensitive Term-Rewriting
At first an introduction to context-sensitive rewrite-systems is given. The main part of this paper deals with the topic how one can prove termination of contextsensitive rewrite-systems. This can be done either by either transforming them into non context-sensitive ones or by extending the existing techniques which are used to prove termination of classic rewrite systems. This is described in ...
متن کامل